Covering the Boundary of a Convex Set by Tiles
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملCovering by Dismembered Convex Discs
Let us consider a great number of convex discs not "too different" from one another about which, apart from their total area, no further data are known. What can be said about the area of the largest square (or any other domain of given shape) which can be covered with the aid of these discs if we are allowed to cut each of them into a given number of suitable pieces? Analogously, we can raise ...
متن کاملA Note on Covering by Convex Bodies
A classical theorem of Rogers states that for any convex body K in n-dimensional Euclidean space there exists a covering of the space by translates of K with density not exceeding n log n+n log log n+5n. Rogers’ theorem does not say anything about the structure of such a covering. We show that for sufficiently large values of n the same bound can be attained by a covering which is the union of ...
متن کاملtranslating allusive devices:a survey of a portrait of the artist as a young man by james joyce
تلمیح یکی از عناصری است که تقریباً در همه ی متون ادبی یافت و باعث ایجاد شکاف های فرهنگی می شود. در این تحقیق به عنوان شکلی از بینامتنیت در ترجمه مورد توجه قرار می گیرد. تلاش شده است تا راهکارهای مترجمان برای ترجمه چهار نوع اسامی خاص و عبارات کلیدی تلمیحی (مذهبی، سیاسی، تاریخی و اسطوره ای) موجود در رمانِ چهره مرد هنرمند در جوانی به فارسی بررسی شود. این تحقیق مقایسه ای بر اساس راهکارهای ترجمه تلمیح...
15 صفحه اولOn covering by translates of a set
In this paper we study the minimal number τ(S,G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, we show that while the worst-case efficiency when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2047500